Mesh Simplification Using Vertex Clustering Based on Principal Curvature
نویسندگان
چکیده
According to the problem that how to increase the fidelity of simplified model, this paper put forward a method which using vertex clustering based on principal curvature. Our measure taking the gradual simplify thinking and simplifying the mesh model successive by quadric error metric and principal curvature based on integral invariants. We improve the defect of error accumulation which consisted in the previous algorithms. Not only ensuring the display effect for the model, but also raising the efficiency of algorithm.
منابع مشابه
Shape-preserving Mesh Simplification based on Curvature Measures from the Polyhedral Gauss Map
This paper presents an improvement on methods for simplification of triangular meshes, based on discrete curvature measures. The basic tool is the Polyhedral Gauss Map (PGM), which is computed directly from a mesh and provides a detailed description of curvature associated with each individual vertex. Taking into consideration this description, we determine the Total Absolute Curvature, abbrevi...
متن کاملMesh Surface Simplification Based on Constrained Energy
A triangle-mesh-surface-simplification algorithm based on a constrained energy function is proposed. In the algorithm, vertices are deleted iteratively according to the dimension-less energy function, which represents the cost of surface modification by vertex deletion and subsequent hole re-triangulation. The energy function is used both for selecting a vertex with the minimum energy for delet...
متن کاملR-Simp: Model Simplification In Reverse
Our algorithm simplifies vertex connectivity using the clustering techniques described in [3]. Unlike [3], it does not evenly voxelize the model; instead simplification varies with curvature. The algorithm begins with the entire model contained within a single cell. This cell is subdivided based on the curvature within the cell. From the cells that result, the cell with the most curvature is se...
متن کاملMesh Simplification by Volume Variation with Feature Preserving
A new algorithm for mesh simplification with triangle constriction is presented in this paper. Constricting error defined by a combination of square volume error variation with constraint (SVEC), shape factor and normal constraint factor of triangle. Gauss curvature factor of each constricted triangle is used to distinguish strong feature triangle or nonstrong feature triangle. The triangle whi...
متن کاملGPU-Accelerated Triangle Mesh Simplification Using Parallel Vertex Removal
We present an approach to triangle mesh simplification designed to be executed on the GPU. We use a quadric error metric to calculate an error value for each vertex of the mesh and order all vertices based on this value. This step is followed by the parallel removal of a number of vertices with the lowest calculated error values. To allow for the parallel removal of multiple vertices we use a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015